DATCP: deadline-aware TCP for the commoditized data centers

doi:10.1016/S1005-8885(11)60318-X

Acta Metallurgica Sinica(English letters) ›› 2012, Vol. 19 ›› Issue (6): 52-62.doi: 10.1016/S1005-8885(11)60318-X

• Networks • Previous Articles Next Articles

DATCP: deadline-aware TCP for the commoditized data centers

State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received:2012-05-28 Revised:2012-09-18 Online:2012-12-31 Published:2012-12-14
Contact: Peng ZHANG E-mail:zhp@bupt.edu.cn
Supported by:
This work was supported by the National Natural Science Foundation of China (61002011), the Open Fund of the State Key Laboratory of Software Development Environment (SKLSDE-2009KF-2-08), the National Basic Research Program of China (2009CB320505), the Hi-Tech Research and Development Program of China (2011AA01A102).

Abstract

Abstract:

Many flows in data centers have deadlines and missing deadlines would hurt application performance such as affecting response quality in Web applications or delaying computing jobs in MapReduce-like systems. However, transmission control protocol (TCP) which is widely used in data centers now cannot provide deadline-aware transmission service. Service differentiation only distinguishes flows with different priority but is unable to guarantee completion time. In this paper, we propose a new protocol named deadline-aware TCP (DATCP) to provide deadline-aware transmission service for the commoditized data centers, which can be used as a flexible method for flow scheduling. DATCP combines flow urgency and importance to calculate precedence. Flow urgency is dynamically adjusted according to the gap between desired rate and actual throughput. Setting importance can avoid starving the important but no-urgent flows. Furthermore, a flow quenching method is presented which allows as many high precedence flows as possible to meet deadlines under heavy network load. By extensive simulations, the performance of DATCP was evaluated. Simulation results show that DATCP can make flows meet deadlines effectively.

Key words:

data center networks (DCN), deadline-aware transmission service, TCP, flow scheduling

References

1. Dean J, Ghemawat S. MapReduce: simplified data processing on large clusters. Proceedings of the 6th USENIX Symposium on Operating System Design and Implementation (OSDI’04), Dec 6-8, 2004, San Francisco, CA, USA. Berkeley, CA, USA: USENIX Association, 2004: 13p

2. Benson T, Akella A, Maltz D A. Network traffic characteristics of data centers in the wild. Proceedings of the 10th Internet Measurement Conference (IMC’10), Nov 1-3, 2010, Melbourne, Australia. New York, NY, USA: ACM, 2010: 267-280

3. Wilson C, Ballani H, Karagiannis T, et al. Better never than late: meeting deadlines in datacenter networks. Proceedings of the ACM SIGCOMM 2011 Conference (SIGCOMM’11), Aug 15-19, 2011, Toronto, Canada. New York, NY, USA: ACM, 2011: 50-61

4. Shieh A, Kandula S, Greenberg A, et al. Sharing the data center network. Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI’11), Mar 30-Apr 1, 2011, Boston, MA, USA. Berkeley, CA, USA: USENIX Association, 2011: 23

5. Benson T, Anand A, Akella A, et al. Understanding datacenter traffic characteristics. Proceedings of the 1st ACM Workshop on Research on enterprise networking (WREN’09), Aug 21, 2009, Barcelona, Spain. New York, NY, USA, 2009: 65-72

6. Alizadeh M, Greenberg A, Maltz D, et al. Data center TCP (DCTCP). Proceedings of the ACM SIGCOMM 2010 Conference (SIGCOMM’10), Aug 30-Sep 3, 2010, New Delhi, India. New York, NY, USA, 2010: 63-74

7. Blake S, Black D, Carlson M, et al. An architecture for differentiated services. IETF RFC 2475.1998

8. Nandagopal T, Lee K W, Li J R, et al. Scalable service differentiation using purely end-to-end mechanisms: features and limitations. Proceedings of the 8th IEEE International Workshop on Quality of Service (IWQOS’00), Jun 5-7, 2000, Pittsburgh, PA, USA. Los Alamitos, CA, USA: IEEE Computer Society, 2000: 813-833

9. Covey R S. The 7 habits of highly effective people. Revised edition. Mankato, MN, USA: Free Press, 2004

10. Ramakrishnan K, Floyd S, Black D. The addition of explicit congestion notification (ECN) to IP. IETF RFC 3168. 2001.

11. White T. Hadoop: the definitive guide. 2nd edition. Sebastopol , CA, USA: O’Reilly Media / Yahoo Press, 2010

12. Ghemawat S, Gobioff H, Leung S T. The Google file system. Proceedings of the 19th ACM SIGOPS Symposium on Operating Systems Principles (SOSP’03), Oct 19-22, 2003, Bolton Landing, NY, USA. New York, NY, USA: ACM, 2003: 29-43

13. Zaharia M, Borthakur D, Sarma J S, et al. Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling. Proceedings of the 5th European conference on Computer systems (EuroSys’10), Apr 13-16, 2010, Paris, France. New York, NY, USA: ACM, 2010: 265-278

14. Vasudevan V, Phanishayee A, Shah H, et al. Safe and effective fine-grained TCP retransmissions for datacenter communication. Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication (SIGCOMM’09), Aug 17-21, 2009, Barcelona, Spain. New York, NY, USA: ACM, 2009: 303-314

15. Chen Y P, Griffith R, Liu J D, et al. Understanding TCP incast throughput collapse in datacenter networks. Proceedings of the 1st ACM Workshop on Research on Enterprise Networking (WREN’09), Aug 21, 2009, Barcelona, Spain. New York, NY, USA: ACM, 2009: 10p

16. Al-Fares M, Loukissas A, Vahdat A. A scalable, commodity data center network architecture. Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication (SIGCOMM’08), Aug 17-22, 2008, Seattle, WA, USA. New York, NY, USA: ACM, 2008: 63-74

17. Greenberg A, Lahiri P, Maltz D A, et al. Towards a next generation data center architecture: scalability and commoditization. Proceedings of the ACM Workshop on Programmable Routers for Extensible Services of Tomorrow (PRESTO’08), Aug 17-22, 2008, Seattle, WA, USA. New York, NY, USA: ACM, 2008: 57-62

18. Guo C X, Wu H T, Tan K, et al. Dcell: a scalable and fault-tolerant network structure for data centers. Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication (SIGCOMM’08), Aug 17-22, 2008, Seattle, WA, USA. New York, NY, USA: ACM, 2008: 75-86

19. Zhang P, Wang H B, Cheng S D. Shrinking MTU to improve the TCP fairness in data center networks. Proceedings of the 3rd IEEE International Conference on Communication Software and Networks (ICCSN’11), May 27-29, 2011, Xi’an, China. Piscataway, NJ, USA: IEEE, 2011: 106-111

Metrics

Comments

Copyright © 2020 The Journal of China Universities of Posts and Telecommunications
　 Adress: P.O. Box 231,Beijing University of Posts and Telecommunications,10 Xi Tucheng Road,Beijing 100876,P.R.China　Post Code: 100081
Tel：86-010-62282493　Fax： 86-010-62283461　E-mail: jchupt@bupt.edu.cn
Support by: Beijing Magtech Co.Ltd

DATCP: deadline-aware TCP for the commoditized data centers

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 0

Recommended Articles

Metrics

Comments